0779e2f59da6698dd898232cf58538e435d92eea,src/algorithm/recursion/PrintTreeBoundaries.java,PrintTreeBoundaries,printLeft,#BinaryTree#,12
Before Change
private static void printLeft(BinaryTree<Integer> root) {
while (root != null) {
System.out.println(root.getValue());
root = root.getLeft();
}
}
After Change
private static void printLeft(BinaryTree<Integer> root) {
if (root != null) {
// Not a leaf node.
if (!(root.getLeft() == null && root.getRight() == null)) {
System.out.println(root.getValue());
printLeft(root.getLeft());
}
}
}